NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
601	CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:50 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory
602	Maximum Motif Problem in Vertex-Colored Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-06-21 01:15:30 Graph coloring NP-complete problems Graph theory Parameterized complexity NP-complete Theoretical computer science Mathematics Applied mathematics
603	Fast Algorithms for Computing Tree LCS Shay Mozes1 Dekel Tsur2 Oren Weimann3 Michal Ziv-Ukelson2 1 Brown University Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-17 10:13:00 Analysis of algorithms Time complexity Tree Spanning tree NP-complete problems Theoretical computer science Computational complexity theory Applied mathematics
604	Approximation Algorithms for Orienting Mixed Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-25 15:14:20 NP-complete problems Graph Directed graph Strongly connected component Strong orientation Graph coloring Path decomposition Graph theory Mathematics Graph connectivity
605	Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint with Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-14 17:20:02 Analysis of algorithms NP-complete problems Closest string Randomized algorithm String Time complexity Algorithm 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
606	arXiv:1107.1052v1 [cs.DS] 6 JulThe traveling salesman problem on cubic and subcubic graphs∗ Sylvia Boyd† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-07-06 20:12:57 Matching Eulerian path Petersen graph Travelling salesman problem Graph Tree Chordal graph Hamiltonian path Planar graph Graph theory NP-complete problems Cubic graph
607	A Local-Search 2-Approximation for 2-Correlation-Clustering? Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in Add to Reading List Source URL: tom.thesnail.org Language: English - Date: 2015-05-04 03:09:24 NP-complete problems Matroid theory Spanning tree Signed graph Clique Graph Tree Eulerian path Pseudoforest Graph theory Theoretical computer science Mathematics
608	Flexible Graph Partitioning of Power Grids with Peer-to-peer Electricity Exchange Kazuhiro Minami, Tomoya Tanjo, Nana Arizumi, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {kminami, tanjo, a Add to Reading List Source URL: systemsresilience.org Language: English - Date: 2014-12-15 22:25:12 Network flow NP-complete problems Graph partition Graph operations Maximum flow problem Topology Flow network Connectivity Planar separator theorem Graph theory Theoretical computer science Mathematics
609	Compactness-Preserving Mapping on Trees Jan Baumbach, Jiong Guo, Rashid Ibragimov Network Alignment Comparison of networks/graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-13 17:44:22 Graph theory Complexity classes NP Graph isomorphism NP-complete problems Theoretical computer science Computational complexity theory Mathematics
610	SOS Lecture 2: Max Cut, Sparsest Cut, Small Set Expansion and some relations of Isoperimetry and Hypercontractivity / Boaz Barak Lecture notes by Adrian Vladu and Henry Yuen Suggested reading • As I mentioned in the em Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2014-10-29 13:20:10 Combinatorial optimization Degree Cut NP-complete problems Combinatorics Randomized algorithm Euclidean algorithm Mathematics Graph theory Theoretical computer science

UPDATE